On unique tensor rank decomposition of 3-tensors
نویسندگان
چکیده
We answer to a question posed recently in reference [Lovitz B, Petrov F. A generalization of Kruskal's theorem on tensor decomposition. Available at arXiv 2103.15633; 2021], proving the conjectured sufficient minimality and uniqueness condition 3-tensor
منابع مشابه
On the generic rank of 3-tensors
We study the generic rank of 3-tensors using results from matrices and algebraic geometry. We state a conjecture about the exact values of the generic rank of 3-tensors over the complex numbers. We also discuss generic ranks over the real numbers. 2000 Mathematics Subject Classification. 14A25, 14P10, 15A69.
متن کاملSymmetric Tensors and Symmetric Tensor Rank
A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-k tensor is the outer product of k non-zero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of them being symmet...
متن کاملEfficient Decomposition of High-Rank Tensors
Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is actually set not by the rank but by the mutual information amongst the variables in question. Representations such as the tensor tree perform near-optimally ...
متن کاملOn the Rank of 3× 3× 3 -tensors
Let U , V andW be finite dimensional vector spaces over the same field. The rank of a tensor τ in U ⊗ V ⊗W is the minimum dimension of a subspace of U ⊗V ⊗W containing τ and spanned by fundamental tensors, i.e. tensors of the form u⊗v⊗w for some u in U , v in V and w inW . We prove that if U , V and W have dimension three, then the rank of a tensor in U ⊗ V ⊗W is at most six, and such a bound c...
متن کاملTensor rank-one decomposition of probability tables
We propose a new additive decomposition of probability tables tensor rank-one decomposition. The basic idea is to decompose a probability table into a series of tables, such that the table that is the sum of the series is equal to the original table. Each table in the series has the same domain as the original table but can be expressed as a product of one-dimensional tables. Entries in tables ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2023
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2023.2211718